| 1. | The open list is kind of like a shopping list
开放列表有点象购物列表。
|
| 2. | If it isn ' t on the open list , add it to the open list
如果它不在开放列表，将它添加进去。
|
| 3. | Add the starting square to the open list
添加开始方块到开放列表。
|
| 4. | Drop it from the open list and add it to the closed list
将他从开放列表取出，并加入封闭列表。
|
| 5. | Li > drop it from the open list and add it to the closed list
将他从开放列表取出，并加入封闭列表。
|
| 6. | Add them to the open list , too
也把它们添加到开放列表。
|
| 7. | So we ' re done and ready to check the next square on our open list
所以处理完毕，并准备检查开放列表中的下一个方块。
|
| 8. | Begin at the starting point a and add it to an " open list " of squares to be considered
从开始点a起，添加它到待考虑的方块的“开放列表” 。
|
| 9. | Every time you access the open list , you need to find the square that has the lowest f cost
每次访问开放列表时，你都需要找到具有最小f值的方块。
|
| 10. | Fail to find the target square , and the open list is empty . in this case , there is no path
没有找到目标方块，并且开放列表是空的。此时，没有路径。
|